Budget-constrained sequential auctions with incomplete information

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Budget-constrained sequential auctions with incomplete information

I study a budget-constrained, private-valuation, sealed-bid sequential auction with two incompletely-informed, risk-neutral bidders in which the valuations and income may be non-monotonic functions of a bidder’s type. Parameters permit the existence of multiple equilibrium symmetric bidding functions that differ in allocation, efficiency and revenue. The sequence of sale affects the competition...

متن کامل

Revenue prediction in budget-constrained sequential auctions with complementarities

When multiple items are auctioned sequentially, the ordering of auctions plays an important role in the total revenue collected by the auctioneer. This is true especially with budget constrained bidders and the presence of complementarities among items. It is difficult to develop efficient algorithms for finding an optimal sequence of items. However, when historical data are available, it is po...

متن کامل

Sequential Auctions of Identical Items with Budget-Constrained Bidders

In this paper, we study sequential auctions with two budget constrained bidders and any number of identical items. All prior results on such auctions consider only two items. We construct a canonical outcome of the auction that is the only natural equilibrium and is unique under a refinement of subgame perfect equilibria. We show certain interesting properties of this equilibrium; for instance,...

متن کامل

Sequential auctions for common value objects with budget constrained bidders

This paper analyzes sequential auctions for budget constrained bidders, for multiple heterogeneous common value objects. In most auctions, bidders not only have valuations for objects but also have budget constraints (i.e., constraints on how much they can actually spend in an auction). Given these constraints, the bidders’ problem is to determine how much to bid in each auction. To this end, t...

متن کامل

Keyword Auctions with Budget-constrained Bidders

We study a keyword auction model where bidders have constrained budgets. In the absence of budget constraints, Edelman, Ostrovsky, and Schwarz (2007) and Varian (2007) analyze “locally envy-free equilibrium” or “symmetric Nash equilibrium” bidding strategies in generalized second-price (GSP) auctions. However, bidders often have to set their daily budgets when they participate in an auction; on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Games and Economic Behavior

سال: 2009

ISSN: 0899-8256

DOI: 10.1016/j.geb.2008.10.001